Algorytm Solvera Dokładnego Sterowany Siecią Petriego Wykorzystujący Gramatyki Grafowe

In this paper we present the Petri net setting the optimal order of elimination for direct solver working with hp refined finite finite element meshes. The computational mesh is represented by a graph, with graph vertices corresponding to finite element nodes. The direct solver algorithm is expressed as a sequence of graph grammar productions, attributing the graph vertices. The Petri net dictates the order of graph grammar productions, representing the execution of the solver algorithm over a graph representation of computational mesh. The presentation is concluded with numerical experiments performed for a model L-shape domain.